Executability and Connexivity in an Interpretation of Griss

Abstract Although the work of G.F.C. Griss is commonly understood as a program negationless mathematics, close examination Griss’s suggests more fundamental feature its executability , requirement that mental constructions are possible only if corresponding activity can be actively carried out. Emphasizing reveals arguments against negation leave open several types negation—including D. Nelson’s strong negation—as compatible with intuitionism. Reinterpreting one executable mathematics we iteratively develop pair bilateral constructive logics and argue for their adequacy accounts propositional basis work. We conclude by observing connexive features exhibited two investigating difficulties principles reveal development mathematics.